q-distributions and Markov processes

نویسندگان

  • Davide Crippa
  • Klaus Simon
چکیده

We consider a sequence of integer{valued random variables Xn; n 1; representing a special Markov process with transition probability the transition probability is given by n;` = q n+`+ and n;` = 1 ? q n+`+ , we can nd closed forms for the distribution and the moments of the corresponding random variables, showing that they involve functions such as the q{binomial coeecients and the q{Stirling numbers. In general it turns out that the q{notation, up to now mainly used in the theory of q{hypergeometrical series, represents a powerful tool to deal with these kinds of problems. In this context we speak therefore about q{distributions. Finally, we present some possible, mainly graph theoretical interpretations of these random variables for special choices of ; and .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trunz Markov Processes Involving q – Stirling Numbers

In this paper we consider the Markov process deened by for transition probabilities n;` = q ` and n;` = q n?1. We give closed forms for the distributions and the moments of the underlying random variables. Thereby we observe that the distributions can be easily described in terms of q{Stirling numbers of the second kind. Their occurrence in a purely time dependent Markov process allows a natura...

متن کامل

Application of Markov Processes to the Machine Delays Analysis

Production and non-productive equipment and personnel delays are a critical element of any production system. The frequency and length of delays impact heavily on the production and economic efficiency of these systems. Machining processes in wood industry are particularly vulnerable to productive and non-productive delays. Whereas, traditional manufacturing industries usually operate on homoge...

متن کامل

Markov Processes Involving q-Stirling Numbers

In this paper we consider the Markov process deened by for transition probabilities n;` = q ` and n;` = q n?1. We give closed forms for the distributions and the moments of the underlying random variables. Thereby we observe that the distributions can be easily described in terms of q{Stirling numbers of the second kind. Their occurrence in a purely time dependent Markov process allows a natura...

متن کامل

Direct analytical methods for determining quasistationary distributions for continuous-time Markov chains

We shall be concerned with the problem of determining the quasistationary distributions of an absorbing continuous-time Markov chain directly from the transition-rate matrix Q. We shall present conditions which ensure that any finite μ-invariant probability measure for Q is a quasistationary distribution. Our results will be illustrated with reference to birth and death processes. QUASISTATIONA...

متن کامل

Algorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity

We address the batch arrival  systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 170  شماره 

صفحات  -

تاریخ انتشار 1997